Character Decompositions
نویسندگان
چکیده
Several decomposition formats exist for image data: principal components, independent components, non-negative components, etc. These decompositions have been applied mainly to natural image data. In this paper, we study the above decompositions for hand-written devanagari character data. We propose a new measure – spatial entropy – for characterizing datasets. Datasets with high spatial entropy are likely to give rise to local features.
منابع مشابه
Quasi-Primary Decomposition in Modules Over Proufer Domains
In this paper we investigate decompositions of submodules in modules over a Proufer domain into intersections of quasi-primary and classical quasi-primary submodules. In particular, existence and uniqueness of quasi-primary decompositions in modules over a Proufer domain of finite character are proved. Proufer domain; primary submodule; quasi-primary submodule; classical quasi-primary; decompo...
متن کاملHowe Duality and Combinatorial Character Formula for Orthosymplectic Lie Superalgebras
We study the Howe dualities involving the reductive dual pairs (O(d), spo(2m|2n)) and (Sp(d), osp(2m|2n)) on the (super)symmetric tensor of C ⊗ C. We obtain complete decompositions of this space with respect to their respective joint actions. We also use these dualities to derive a character formula for these irreducible representations of spo(2m|2n) and osp(2m|2n) that appear in these decompos...
متن کاملInfinite-dimensional versions of the primary, cyclic and Jordan decompositions
The famous primary and cyclic decomposition theorems along with the tightly related rational and Jordan canonical forms are extended to linear spaces of infinite dimensions with counterexamples showing the scope of extensions.
متن کاملComputations for Coxeter arrangements and Solomon's descent algebra: Groups of rank three and four
In recent papers we have refined a conjecture of Lehrer and Solomon expressing the character of the representation of a finite Coxeter group W on the pth graded piece of its Orlik-Solomon algebra as a sum of characters induced from linear characters of centralizers of elements of W . Our refined conjecture relates the character of W on the pth graded piece of its Orlik-Solomon algebra with the ...
متن کاملFrom neuronal cost-based metrics towards sparse coded signals classification
Sparse signal decompositions are keys to efficient compression, storage and denoising, but they lack appropriate methods to exploit this sparsity for a classification purpose. Sparse coding methods based on dictionary learning may result in spikegrams, a sparse and temporal representation of signals by a raster of kernel occurrences through time. This paper proposes a method for coupling spike ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002